Two-dimensional pattern matching with rotations
نویسندگان
چکیده
منابع مشابه
Faster Two Dimensional Pattern Matching with Rotations
The most efficient currently known algorithms for two dimensional pattern matching with rotations have a worst case time complexity of O(nm), where the size of the text is n × n and the size of the pattern is m × m. In this paper we present a new algorithm for the problem whose running time is O(nm).
متن کاملTwo-Dimensional Pattern Matching with Rotations
The problem of pattern matching with rotation is that of 2nding all occurrences of a twodimensional pattern in a text, in all possible rotations. We prove an upper and lower bound on the number of such di4erent possible rotated patterns. Subsequently, given an m × m array (pattern) and an n × n array (text) over some 2nite alphabet , we present a new method yielding an O(nm) time algorithm for ...
متن کاملExact and Approximate Two Dimensional Pattern Matching allowing Rotations
We give fast ltering algorithms for searching a 2{dimensional pattern in a 2{dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n n character and a pattern of size m m characters, the exact matching takes average time O(n 2 =m). If we allow k{mismatches o...
متن کاملFast Two-Dimensional Pattern Matching
An algorithm for searching for a two dimensional m m pattern in a two dimensional n n text is presented. It performs on the average less comparisons than the size of the text: n 2 =m using m 2 extra space. Basically, it uses multiple string matching on only n=m rows of the text. It runs in at most 2n 2 time and is close to the optimal n 2 time for many patterns. It steadily extends to an alphab...
متن کاملOptimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations
We give fast filtering algorithms to search for a 2– dimensional pattern in a 2–dimensional text allowing any rotation of the pattern. We consider the cases of exact and approximate matching under several matching models, improving the previous results. For a text of size n× n characters and a pattern of size m×m characters, the exact matching takes average time O(n log m/m), which is optimal. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.10.039